Towards a Top-K SPARQL Query Benchmark
نویسندگان
چکیده
The research on optimization of top-k SPARQL query would largely benefit from the establishment of a benchmark that allows comparing different approaches. For such a benchmark to be meaningful, at least two requirements should hold: 1) the benchmark should resemble reality as much as possible, and 2) it should stress the features of the topk SPARQL queries both from a syntactic and performance perspective. In this paper we propose Top-k DBPSB: an extension of the DBpedia SPARQL benchmark (DBPSB), a benchmark known to resemble reality, with the capabilities required to compare SPARQL engines on top-k queries.
منابع مشابه
Towards a Top-K SPARQL Query Benchmark Generator
The research on optimization of top-k SPARQL query would largely benefit from the establishment of a benchmark that allows comparing different approaches. For such a benchmark to be meaningful, at least two requirements should hold: 1) the benchmark should resemble reality as much as possible, and 2) it should stress the features of the topk SPARQL queries both from a syntactic and performance ...
متن کاملSpec-QP: Speculative Query Planning for Joins over Knowledge Graphs
Organisations store huge amounts of data from multiple heterogeneous sources in the form of Knowledge Graphs (KGs). One of the ways to query these KGs is to use SPARQL queries over a database engine. Since SPARQL follows exact match semantics, the queries may return too few or no results. Recent works have proposed query relaxation where the query engine judiciously replaces a query predicate w...
متن کاملEfficient Execution of Top-K SPARQL Queries
Top-k queries, i.e. queries returning the top k results ordered by a user-defined scoring function, are an important category of queries. Order is an important property of data that can be exploited to speed up query processing. State-of-the-art SPARQL engines underuse order, and top-k queries are mostly managed with a materialize-then-sort processing scheme that computes all the matching solut...
متن کاملRDF Keyword Search Using a Type-based Summary
Keyword search enjoys great popularity due to succinctness and easy operability for exploring RDF data. SPARQL has been recommended as the standard query language that can retrieve any answers users need from available RDF data. Thus, keyword search based on keywords-to-SPARQL attracts more and more attention. However, existing solutions have main limitations that the summary index used for tra...
متن کاملA Heuristic-Based Approach for Planning Federated SPARQL Queries
A large number of SPARQL endpoints are available to access the Linked Open Data cloud, but query capabilities still remain very limited. Thus, to support efficient semantic data management of federations of endpoints, existing SPARQL query engines require to be equipped with new functionalities. First, queries need to be decomposed into sub-queries not only answered by the available endpoints, ...
متن کامل